Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
نویسندگان
چکیده
منابع مشابه
Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan
The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be executed by several processors simultaneously and the processing speed of a task is a nonlinear function of the number of processors allocated to it. The total number of processors is m and it is an upper bound on the number of processors that can be used by all the ...
متن کاملScheduling multiprocessor tasks on two parallel processors
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
متن کاملScheduling Tasks with Exponential Service Times on Non-Identical Processors to Minimize Various Cost Functions
We consider preemptive scheduling of N tasks on m processors; processors have different speeds, tasks require amounts of work which are exponentially distributed, with different parameters. The policies of assigning at every moment the task with shortest (longest) expected processing time among those not yet completed to the fastest processor available, second shortest (longest) to the second f...
متن کاملParallel Local Search to schedule communicating tasks on identical processors
The paper reports on the analysis of parallelization strategies for Local Search (LS) when the neighborhood size varies throughout the search, the Multiprocessor Scheduling Problem with Communication Delays (MSPCD) illustrating the methodology and results. The dynamic load distribution strategy implemented within a master-slave framework is shown to offer the best performance. Experimental resu...
متن کاملRandomized On-Line scheduling similar jobs to minimize makespan on two identical processors
In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without preemption. The objective is to minimize makespan. We devise a randomized on-line algorithm for this problem along with a lower bound.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1989
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0402016